Abstract :Due to unprotected large buffers in network devices, the Internet is suffering from high latency and
jitter which leads to decreased throughput. The perseveringly full buffer problem, recently exposed as
“bufferbloat” [1] [2] has been observed for decades, but is still with us. As a solution to this problem, several
new AQM algorithms CoDel, sfqCoDel and CoDel-DT have been proposed. This paper aims to evaluate these
AQM algorithms by carrying out simulations in ns-2 and compares their performance with that of DropTail.
sfqCoDel outperforms various peer solutions in variety of scenarios in terms of bottleneck link utilization, packet
drop rate and mean queue length.